On implementation choices for iterative improvement partitioning algorithms
نویسندگان
چکیده
منابع مشابه
New Bucket Managements in Iterative Improvement Partitioning Algorithms
In iterative improvement partitioning algorithms, tie-breaking in the choice of maximum-gain vertices has a great impact on the performance. We propose a new tie-breaking strategy in an iterative improvement algorithm for graph partitioning. The proposed method is simple but nevertheless performed better than other traditional techniques.
متن کاملHardwareBoftware Partitioning with Iterative Improvement Heuristics
The paper presents two heuristics for hardwarelsoftware partitioning of system level spec@cations. The main objective is to achieve pedormance optimization with a limited hardware and software cost. We consider minimization of communication cost and improvement of the overall parallelism as essential criteria. One ofthe heuristics is based on simulated annealing and the other on tabu search. Ex...
متن کاملapplication of upfc based on svpwm for power quality improvement
در سالهای اخیر،اختلالات کیفیت توان مهمترین موضوع می باشد که محققان زیادی را برای پیدا کردن راه حلی برای حل آن علاقه مند ساخته است.امروزه کیفیت توان در سیستم قدرت برای مراکز صنعتی،تجاری وکاربردهای بیمارستانی مسئله مهمی می باشد.مشکل ولتاژمثل شرایط افت ولتاژواضافه جریان ناشی از اتصال کوتاه مدار یا وقوع خطا در سیستم بیشتر مورد توجه می باشد. برای مطالعه افت ولتاژ واضافه جریان،محققان زیادی کار کرده ...
15 صفحه اولPartitioning Algorithms for Simultaneously Balancing Iterative and Direct Methods
This paper focuses on domain decomposition-based numerical simulations whose subproblems corresponding to the various subdomains are solved using sparse direct factorization methods (e.g., FETI). Effective load-balancing of such computations requires that the resulting partitioning simultaneously balances the amount of time required to factor the local subproblem using direct factorization, and...
متن کاملVlsi Circuit Partitioning by Cluster - Removalusing Iterative Improvement
Move-based iterative improvement partitioning methods such as the Fiduccia-Mattheyses (FM) algorithm 3] and Krishnamurthy's Look-Ahead (LA) algorithm 4] are widely used in VLSI CAD applications largely due to their time eeciency and ease of implementation. This class of algorithms is of the \local improvement" type. They generate relatively high quality results for small and medium size circuit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 1997
ISSN: 0278-0070
DOI: 10.1109/43.662682